Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
g(X) |
→ h(X) |
| 2: |
|
c |
→ d |
| 3: |
|
h(d) |
→ g(c) |
|
There are 3 dependency pairs:
|
| 4: |
|
G(X) |
→ H(X) |
| 5: |
|
H(d) |
→ G(c) |
| 6: |
|
H(d) |
→ C |
|
The approximated dependency graph contains one SCC:
{4,5}.
-
Consider the SCC {4,5}.
The usable rules are {2}.
The constraints could not be solved.
Tyrolean Termination Tool (0.00 seconds)
--- May 4, 2006